Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
f(a,f(x,a)) |
→ f(f(x,f(f(a,a),a)),a) |
|
There are 4 dependency pairs:
|
| 2: |
|
F(a,f(x,a)) |
→ F(f(x,f(f(a,a),a)),a) |
| 3: |
|
F(a,f(x,a)) |
→ F(x,f(f(a,a),a)) |
| 4: |
|
F(a,f(x,a)) |
→ F(f(a,a),a) |
| 5: |
|
F(a,f(x,a)) |
→ F(a,a) |
|
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006